­
­
­
­

Inventi Impact: Modeling & Simulation

Articles

  • Inventi:ems/68/14
    UTILIZATION BOUND SCHEDULING ANALYSIS FOR NONPREEMPTIVE UNIPROCESSOR ARCHITECTURE USING UML-RT
    30-Jun-2014 Research 2014 : July - September
    S Ewins Pon Pushpa, Manamalli Devasigamani

    The key for adopting the utilization-based schedulability test is to derive the utilization bound. Given the computation times,\nthis paper proposes two utilization bound algorithms to derive interrelease times for nonpreemptive periodic tasks, using a new\npriority scheme, ââ?¬Å?RateMonotonic Algorithm-Shortest Job First.ââ?¬ÂThe obtained task set possesses the advantage of RateMonotonic\nAlgorithm and Shortest Job First priority scheme. Further, the task set is tested for schedulability, by first deriving a general\nschedulability condition from ââ?¬Å?problem windowââ?¬Â analysis and, a necessary and sufficient schedulability condition for a task to\nbe scheduled, at any release time are also derived. As a technical contribution, success ratio and effective processor utilization are\nanalyzed for our proposed utilization bound algorithms on a uniprocessor architecture modeled using UML-RT.

    How to Cite this Article
    CC Compliant Citation: S. Ewins Pon Pushpa and Manamalli\nDevasigamani, â??Utilization Bound Scheduling Analysis for\nNonpreemptive Uniprocessor Architecture Using UML-RT,â?\nModelling and Simulation in Engineering, vol. 2014, Article ID\n705929, 11 pages, 2014. doi:10.1155/2014/705929.\nCopyright © 2014 S. Ewins Pon Pushpa and Manamalli Devasigamani. This is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
    Download Full Text